Logic of proofs

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hypothetical Logic of Proofs

The Logic of Proofs (LP) [2–5] is a refinement of modal logic introduced by Artemov in 1995 which has recently been proposed for explaining well-known paradoxes arising in the formalization of Epistemic Logic. Assertions of knowledge and belief are accompanied by justifications: the formula [[t]]A states that proof witness t is “reason” for knowing/believing A. Also, LP is capable of reflecting...

متن کامل

Symmetric Logic of Proofs

The Logic of Proofs LP captures the invariant propositional properties of proof predicates t is a proof of F with a set of operations on proofs sufficient for realizing the whole modal logic S4 and hence the intuitionistic logic IPC. Some intuitive properties of proofs, however, are not invariant and hence not present in LP. For example, the choice function ‘+’ in LP, which is specified by the ...

متن کامل

Intuitionistic Logic of Proofs

The logic of proofs LP was introduced in [3] and thoroughly studied in [1]. LP is a natural extension of the propositional calculus in the language representing proofs as formal objects. Proof expressing terms are constructed using constants, variables, and symbols of natural operations on derivations. Then formula t :F has the intended interpretation “t is a proof of F”. LP is complete with re...

متن کامل

Referential logic of proofs

We introduce an extension of the propositional logic of single-conclusion proofs by the second order variables denoting the reference constructors of the type “the formula which is proved by x.” The resulting Logic of Proofs with References, FLPref, is shown to be decidable, and to enjoy soundness and completeness with respect to the intended provability semantics. We show that FLPref provides ...

متن کامل

Logic of Proofs

In this paper individual proofs are integrated into provability logic. Systems of axioms for a logic with operators \A is provable" and \p is a proof of A" are introduced, provided with Kripke semantics and decision procedure. Completeness theorems with respect to the arithmetical interpretation are proved.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of Pure and Applied Logic

سال: 1994

ISSN: 0168-0072

DOI: 10.1016/0168-0072(94)90007-8